Weak Sharp Minima in Multicriteria Linear Programming
نویسندگان
چکیده
In this short note, we study the existence of weak sharp minima in multicriteria linear programming. It is shown that weak sharp minimality holds for certain residual functions and gap functions.
منابع مشابه
A Partition-Based Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems*
We propose a learning-oriented interactive algorithm for solving multicriteria linear integer programming (MCLIP) problems, considered as multicriteria decision making problems. At each iteration, the DM may partition the criteria set into at most seven classes, namely: improvement, improvement by a desired amount, deterioration, deterioration by at most a certain amount, nondeterioration, chan...
متن کاملOn Weak Sharp Minima for a Special Class of Nonsmooth Functions
We present a characterization of weak sharp local minimizers of order one for a function f : R → R defined by f(x) := max{fi(x)|i = 1, ..., p}, where the functions fi are strictly differentiable. It is given in terms of the gradients of fi and the Mordukhovich normal cone to a given set on which f is constant. Then we apply this result to a smooth nonlinear programming problem with constraints.
متن کاملA Reference Neighbourhood Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems
The interactive algorithm [2] are widely used for solving multicriteria linear integer programming problems. Some of the interactive algorithms work with the aspiration levels of the criteria, others use weights to denote the relative significance of the criteria. We propose a learning-oriented [4] interactive algorithm for solving multicriteria linear integer programming problems. The main fea...
متن کاملEquivalent properties of global weak sharp minima with applications
* Correspondence: [email protected] Department of Mathematics, School of Science, Shandong University of Technology, Zibo, 255049, China Full list of author information is available at the end of the article Abstract In this paper, we study the concept of weak sharp minima using two different approaches. One is transforming weak sharp minima to an optimization problem; another is using conju...
متن کاملWeak Sharp Minima on Riemannian Manifolds
This is the first paper dealing with the study of weak sharp minima for constrained optimization problems on Riemannian manifolds, which are important in many applications. We consider the notions of local weak sharp minima, boundedly weak sharp minima, and global weak sharp minima for such problems and establish their complete characterizations in the case of convex problems on finite-dimensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 15 شماره
صفحات -
تاریخ انتشار 2005